Multiset Storage Automata

نویسندگان

  • Manfred Kudlek
  • Patrick Totzke
  • Georg Zetzsche
چکیده

Two kinds of multiset automata with a storage attached, varying only in their ability of testing the storage for emptiness, are introduced, as well as normal forms. Their accepting power and relation to other multiset languages classes is investigated.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Properties of Multiset Language Classes Defined by Multiset Storage Automata

The previously introduced multiset language classes defined by multiset storage automata are being explored with respect to their closure properties and alternative characterizations.

متن کامل

On fuzzy multiset regular grammars

The main goal of this paper is to introduce and study fuzzy multiset regular grammar to show that fuzzy multiset finite automata and fuzzy multiset regular grammars are equivalent. We also study fuzzy multiset linear grammars and fuzzy multiset regular grammars in normal form. Furthermore, we show the equivalence of fuzzy multiset regular grammars, fuzzy multiset left linear grammars, fuzzy mul...

متن کامل

Translating Multiset Tree Automata into P Systems

In this work we propose a translation scheme to obtain P systems with membrane creation rules from transitions of multiset tree automata (MTA).

متن کامل

Pushdown automata, multiset automata, and Petri nets

In this paper, we consider various classes of (in)nite-state) automata generated by simple rewrite transition systems. These classes are de)ned by two natural hierarchies, one given by interpreting concatenation of symbols in the rewrite system as sequential composition, and the other by interpreting concatenation as parallel composition. In this way, we provide natural definitions for commutat...

متن کامل

On Two Families of Multiset Tree Automata

The relation between the membrane structures of P systems and an extension of tree automata which introduces multisets in the transition function has been proposed in previous works. Here we propose two features of tree automata which have been previously studied (namely, reversibility and local testability) in order to extend them to multiset tree automata. The characterization of these famili...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009